Clustering Wireless Ad Hoc Networks with Boundary Nodes

نویسندگان

  • Chih-Cheng Tseng
  • Kwang-Cheng Chen
چکیده

Based on the observation that most of the orphan clusters are generated from boundary nodes, we propose a Boundary-First Cluster-Minimized (BFCM) clustering algorithm to minimize the number of generated orphan cluster by boundary node. The proposed algorithm is compared to the well known IDbased and Degree-based algorithms. The simulation results show that with the same message and time complexities as the compared algorithms, the proposed algorithm generates the minimum number of orphan clusters and, thus, the total number of generated clusters are minimized. Keywords-ad hoc networks, boundary node, cluster, orphan cluster, typical node

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Broadcast Routing in Wireless Ad-Hoc Networks: A Particle Swarm optimization Approach

While routing in multi-hop packet radio networks (static Ad-hoc wireless networks), it is crucial to minimize power consumption since nodes are powered by batteries of limited capacity and it is expensive to recharge the device. This paper studies the problem of broadcast routing in radio networks. Given a network with an identified source node, any broadcast routing is considered as a directed...

متن کامل

Vehicular Networks: A Survey on Architecture, Communication Technologies and Applications

The Intelligent Transportation System (ITS) provides wireless and mobile communication between vehicles and infrastructure to improve the safety of transportation and make the journey more enjoyable. This system consists of many fixed and mobile nodes (Vehicles, Trains, Vessels, Air planes), Wireless and Wired Telecommunication Technologies to exchange information between mobile nodes or betwee...

متن کامل

LEBRP - A Lightweight and Energy Balancing Routing Protocol for Energy-Constrained Wireless Ad Hoc Networks

A wireless ad hoc network typically refers to any set of wireless networks where all devices have equal status on a network and are free to associate with any other wireless ad hoc network devices in their range. As the nature of these networks, they commonly do not have external power supplies, and each node has a limited internal power source. In this paper, we put forward a new routing proto...

متن کامل

The Feedback Based Mechanism for Video Streaming Over Multipath Ad Hoc Networks

Ad hoc networks are multi-hop wireless networks without a pre-installed infrastructure. Such networks are widely used in military applications and in emergency situations as they permit the establishment of a communication network at very short notice with a very low cost. Video is very sensitive for packet loss and wireless ad-hoc networks are error prone due to node mobility and weak links. H...

متن کامل

طراحی لایه- متقاطع برای کنترل ازدحام، مسیریابی و زمان‌بندی در شبکه‌های بی‌سیم ad-hocبا در نظر‌گرفتن توان الکتریکی گره‌ها

Abstract Ad hoc Wireless Networks, are networks formed by a collection of nodes through radio. In wireless networking environment, formidable challenges are presented. One important challenge is connection maintenance mechanism for power consumption. In this paper, a multi-objective optimal design is considered for ad-hoc networks which address the electrical power of nodes effects on cross-l...

متن کامل

استفاده از خوشه بندی در پروتکل مسیریابی AODV برای شبکه های بین خودرویی بر روی سناریوی بزرگراه

Vehicular Ad hoc networks are a subset of mobile Ad hoc networks in which vehicles are considered as network nodes. Their major difference is rapid mobility of nodes which causes the quick change of topology in this network. Quick changes in the topology of the network are considered as a big challenge For routing in these networks, routing protocols must be robust and reliable. AODV Routing pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005